2

Branch and Recharge: Exact Algorithms for

Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff
Journal:
Algorithmica
Year:
2011
Language:
english
File:
PDF, 676 KB
english, 2011
3

On Independent Sets and Bicliques in Graphs

Serge Gaspers, Dieter Kratsch, Mathieu Liedloff
Journal:
Algorithmica
Year:
2012
Language:
english
File:
PDF, 1.04 MB
english, 2012
6

Iterative compression and exact algorithms

Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh
Journal:
Theoretical Computer Science
Year:
2010
Language:
english
File:
PDF, 592 KB
english, 2010
7

Exact Algorithms forL(2,1)-Labeling of Graphs

Frédéric Havet, Martin Klazar, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff
Journal:
Algorithmica
Year:
2011
Language:
english
File:
PDF, 850 KB
english, 2011
9

An exact algorithm for the minimum dominating clique problem

Dieter Kratsch, Mathieu Liedloff
Journal:
Theoretical Computer Science
Year:
2007
Language:
english
File:
PDF, 657 KB
english, 2007
15

Complexity of splits reconstruction for low-degree trees

Gaspers, Serge, Liedloff, Mathieu, Stein, Maya, Suchan, Karol
Journal:
Discrete Applied Mathematics
Year:
2015
Language:
english
File:
PDF, 546 KB
english, 2015
20

Finding a dominating set on bipartite graphs

Mathieu Liedloff
Journal:
Information Processing Letters
Year:
2008
Language:
english
File:
PDF, 110 KB
english, 2008
26

An exact algorithm for connected red–blue dominating set

Faisal N. Abu-Khzam, Amer E. Mouawad, Mathieu Liedloff
Journal:
Journal of Discrete Algorithms
Year:
2011
Language:
english
File:
PDF, 374 KB
english, 2011
29

On finding optimal polytrees

Gaspers, Serge, Koivisto, Mikko, Liedloff, Mathieu, Ordyniak, Sebastian, Szeider, Stefan
Journal:
Theoretical Computer Science
Year:
2015
Language:
english
File:
PDF, 404 KB
english, 2015